Digraphs having the same canonical double covering
نویسندگان
چکیده
منابع مشابه
Covering digraphs by paths
The problems of miniiiwn Lg.: ana minimum vertex covers by paths results relate to papers by Galki-M&ram, Meyniel, Alspach-Pullman and mait resulti is contimed with partially ordered sets. are discussed. The others. One of tie NM+oak The terminology is rather standard, generally following Berge [3]. In any case where ar&iguity may arise we give +finiticns. Graphs alnd digraphs are f@ite, except...
متن کاملCharacteristic polynomials of ramified uniform covering digraphs
We give a decomposition formula for the characteristic polynomials of ramified uniform covers of digraphs. Similarly, we obtain a decomposition formula for the characteristic polynomials of ramified regular covers of digraphs. As applications, we establish decomposition formulas for the characteristic polynomials of branched covers of digraphs and the zeta functions of ramified covers of digraphs.
متن کاملDouble Threshold Digraphs
A semiorder is a model of preference relations where each element x is associated with a utility value α(x), and there is a threshold t such that y is preferred to x iff α(y) > α(x) + t. These are motivated by the notion that there is some uncertainty in the utility values we assign an object or that a subject may be unable to distinguish a preference between objects whose values are close. How...
متن کاملOn Set Systems Having Paradoxical Covering Properties
1. R2-phenomena . Our set theoretic notation will be standard with one exception . Since this paper is largely concerned with powers of ordinals, the symbol ~" will always denote ordinal exponentiation for ordinals ~, 11 . Thus, in particular, if fl--a, then cos is an ordinal <coy+1 . When we use cardinal exponentiation we shall either say so or, if there is no danger of confusion, we write 2 1...
متن کاملKernels by monochromatic paths in digraphs with covering number 2
We call the digraph D an m-colored digraph if the arcs of D are colored with m colors. A subdigraph H of D is called monochromatic if all of its arcs are colored alike. A set N ⊆ V (D) is said to be a kernel by monochromatic paths if it satisfies the following two conditions: (i) for every pair of different vertices u, v ∈ N there is no monochromatic directed path between them and; (ii) for eve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1997
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00018-6